Network stability under max–min fair bandwidth sharing
نویسندگان
چکیده
منابع مشابه
Stochastic Stability Under Fair Bandwidth Allocation: General File Size Distribution
We prove the stochastic stability of resource allocation under Network Utility Maximization (NUM) under general arrival process and file size distribution with bounded support, for α-fair utilities with α sufficiently small and possibly different for different sources’ utility functions. In addition, our results imply that the system operating under α-fair utility is 1/(1 + α)-approximate stabl...
متن کاملRainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechanisms. Traditional mechanisms to achieve fair sharing (e.g., Weighted Fair Queueing, Flow Random Early Discard) require per-flow state to determine which packets to drop under congestion, and therefore are complex to implement at t...
متن کاملWeighted fair bandwidth sharing using SCALE technique
Currently there is not enough work on the Internet weighted fair bandwidth sharing without per-flow management, especially when both UDP and TCP flows of different RTTs and different bandwidth targets coexist. This paper contains two contributions: 1) A mechanism called SCALE-WFS, Scalable Core with Aggregation Level labEling Weighted Fair bandwidth-Sharing, is presented to achieve near-optimal...
متن کاملFluid model for a data network with α-fair bandwidth sharing and general document size distributions: two examples of stability
Abstract: The design and analysis of congestion control mechanisms for modern data networks such as the Internet is a challenging problem. Mathematical models at various levels have been introduced in an effort to provide insight to some aspects of this problem. A model introduced and studied by Roberts and Massoulié [13] aims to capture the dynamics of document arrivals and departures in a net...
متن کاملMaxmin fair scheduling in wireless networks
We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2010
ISSN: 1050-5164
DOI: 10.1214/09-aap649